Computing Characteristic Sets of Ordinary Radical Differential Ideals
نویسندگان
چکیده
We give upper bounds for the order of the elements in a characteristic set of a regular differential ideal or a radical of a finitely generated differential ideal with respect to some specific orderings. We then show how to compute characteristic sets of these ideals using algebraic methods. 2000 Mathematics Subject Classification: 12H05, 13B25, 13P10.
منابع مشابه
Factorization-free Decomposition Algorithms in Differential Algebra
This paper makes a contribution to differential elimination and more precisely to the problem of computing a representation of the radical differential ideal generated by a system of differential equations (ordinary or partial). The approach we use here involves characteristic set techniques;‡ these were introduced by J. F. Ritt, the founder of differential algebra. The basic idea is to write t...
متن کاملm at h . A C ] 1 6 Fe b 20 07 Bounds for algorithms in differential algebra 1
We consider the Rosenfeld-Gröbner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F , let M(F ) be the sum of maximal orders of differential indeterminates occurring in F . We propose a modification of the Rosenfeld-Gröbner algorithm, in whi...
متن کاملBounds for algorithms in differential algebra
We consider the Rosenfeld-Gröbner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F , let M(F ) be the sum of maximal orders of differential indeterminates occurring in F . We propose a modification of the Rosenfeld-Gröbner algorithm, in whi...
متن کاملCompleteness results for metrized rings and lattices
The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...
متن کاملA bound for the Rosenfeld-Gröbner algorithm
We consider the Rosenfeld–Gröbner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F , let M(F) be the sum of maximal orders of differential indeterminates occurring in F . We propose a modification of the Rosenfeld–Gröbner algorithm, in whic...
متن کامل